Finite Precision Analysis of the Conventional QR Decomposition RLS Algorithm - Circuits and Systems, 1994., Proceedings of the 37th Midwest Symposium on
نویسندگان
چکیده
This paper presents relations for predicting the mean squared values in the deviations of the outputs in the Conventional QRDRLS algorithm [l] due to quantization effects. A set of formulas are presented, along with a procedure to employ them to calculate the expected value of squared norm of the tap deviation and the mean squared value of the error signal deviation. Simulation results are presented to show the accuracy of the obtained results.
منابع مشابه
Infinite Precision Analysis of the Fast QR Decomposition RLS Algorithm
Abatmxct-This work develops relations for the mean squared value of internal variables in the Fast QRD-RLS. The objective is to derive relations based on known characteristics of input signals that predict the behavior of the internal quantities of the algorithm. It is shown that the Fast and Conventional QRD-RLS algorithms have some variables in common, and thus previous results of the infinit...
متن کاملA Linearly Constrained IQRD-RLS Algorithm for Blind Multiuser Detection in CDMA Systems
In this paper we propose an inverse QR decomposition based recursive least squares algorithm (IQRD-RLS) for the linearly constrained minimum variance (LCMV) receiver for CDMA transmission systems. The proposed algorithm is numerically stable in finite precision environments and it is suitable for implementation in systolic arrays or DSP vector architectures. It is shown through computer simulat...
متن کاملA Rule-based Approach for High Speed Adders Design Verification - Circuits and Systems, 1994., Proceedings of the 37th Midwest Symposium on
-In this paper, a rule-based framework for formal hardware verification is presented. The PROVER system (PROduction system for hardware VERification) is implemented using CLIPS (C Language Integrated Production System). The environment supports verification at different levels of hardware specification. The rule-based framework has been tested on the design of high speed adders.
متن کاملInfinite Precision Analysis of the Fast or Algorithms Based on Backward Prediction Errors
The conventional QR Decomposition Recursive Least Squares (QRD-RLS) method requires the order of X 2 multiplications-O[1\,JJ-per output sample. Nevertheless. a number of Fast QRD-RLS algorithms have been proposed with O[lYJ of complexity. Particularly thc Fast QRD-RLS al gorithms based on backward prediction enol'S are well known for their good numerical behaviors and low complexities. In such...
متن کاملA Family of Recursive Least-squares Adaptive Algorithms Suitable for Fixed-point Implementation
The main feature of the least-squares adaptive algorithms is their high convergence rate. Unfortunately, they encounter numerical problems in finite precision implementation and especially in fixed-point arithmetic. The objective of this paper is twofold. First, an analysis of the finite precision effects of the recursive least-squares (RLS) algorithm is performed, outlining some specific probl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004